Strictly orthogonal left linear rewrite systems and primitive recursion
نویسندگان
چکیده
منابع مشابه
Strong Sequentiality of Left-Linear Overlapping Rewrite Systems
Connuent term rewriting systems can be seen as a model for functional computations, in which redexes corresponding to instances of left hand sides of rules are repeatedly replaced by their corresponding right hand side instance. Lazy sequential strategies reduce a given redex in a term if and only if this redex must be reduced by any other sequential strategy computing the normal form of the te...
متن کاملSemantic Matching for Left-Linear Convergent Rewrite Systems
In this paper a calculus for solving the semantic matching problem with respect to left-linear or variable-preserving convergent termrewriting systems is presented. Narrowing calculi usually use advanced selection rules to reduce the search space. Our approach to designing a special calculus for special goals is another way of reducing the efficiency defects of narrowing. Our calculus construct...
متن کاملCoLL: A Confluence Tool for Left-Linear Term Rewrite Systems
We present a confluence tool for left-linear term rewrite systems. The tool proves confluence by using Hindley’s commutation theorem together with three commutation criteria, including Church-Rosser modulo associative and/or commutative theories. Despite a small number of its techniques, experiments show that the tool is comparable to recent powerful confluence tools.
متن کاملGeneralizing Newman's Lemma for Left-Linear Rewrite Systems
Confluence criteria for non-terminating rewrite systems are known to be rare and notoriously difficult to obtain. Here we prove a new result in this direction. Our main result is a generalized version of Newman’s Lemma for left-linear term rewriting systems that does not need a full termination assumption. We discuss its relationships to previous confluence criteria, its restrictions, examples ...
متن کاملCentrum Voor Wiskunde En Informatica within Arm's Reach: Compilation of Left-linear Rewrite Systems via Minimal Rewrite Systems within Arm's Reach: Compilation of Left-linear Rewrite Systems via Minimal Rewrite Systems
A new compilation technique for left-linear term rewriting systems is presented, where rewrite rules are transformed into so-called minimal rewrite rules. These minimal rules have such a simple form that they can be viewed as instructions for an abstract rewriting machine (ARM). Keywords and Phrases: minimal term rewriting systems, abstract machines, program transformations Note: Part of this w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 2001
ISSN: 0168-0072
DOI: 10.1016/s0168-0072(00)00041-5